A 27-node hybrid brick and a 21-node hybrid wedge element for structural analysis
نویسندگان
چکیده
منابع مشابه
A four-node hybrid assumed-strain finite element for laminated composite plates
Fibre-reinforced plates and shells are finding an increasing interest in engineering applications. Consequently, efficient and robust computational tools are required for the analysis of such structural models. As a matter of fact, a large amount of laminate finite elements have been developed and incorporated in most commercial codes for structural analysis. In this paper a new laminate hybrid...
متن کاملA Novel Hybrid Node Localization Algorithm for Wireless Sensor Networks
Node self-localization is one of the supporting technologies in Wireless Sensor Networks (WSNs). In this study, a distributed hybrid localization algorithm based on divide-and-conquer and refinement method is proposed. Firstly, the effect of ranging error in the Received Signal Strength (RSS) model on node localization is analyzed and the topology relations of anchors and unknown nodes are deri...
متن کاملA node-based element for analysis of planar piezoelectric structures
A novel node-based smoothing element for triangular and quadrilateral meshes is presented for static analysis of planar piezoelectric structures. In contrast to the smoothed finite element formulation that was based on sub-cells within an original quadrilateral element, this new method transforms a general original finite element mesh into a mesh of new smoothing cells individually associated w...
متن کاملA Hybrid Stress Plane Element with Strain Field
In this paper, a plane quadrilateral element with rotational degrees of freedom is developed. Present formulation is based on a hybrid functional with independent boundary displacement and internal optimum strain field. All the optimality constraints, including being rotational invariant, omitting the parasitic shear error and satisfying Fliepa’s pure bending test, are considered. Moreover, the...
متن کاملHybrid constructive heuristics for the critical node problem
We consider the Critical Node Problem: given an undirected graph and an integer number K, at most K nodes have to be deleted from the graph in order to minimize a connectivity measure in the residual graph. We combine the basic steps used in common greedy algorithms with some flavour of local search, in order to obtain simple “hybrid” heuristic algorithm. The obtained algorithms are shown to be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Elements in Analysis and Design
سال: 2005
ISSN: 0168-874X
DOI: 10.1016/j.finel.2004.11.007